Improving XCP to achieve max–min fair bandwidth allocation
نویسندگان
چکیده
منابع مشابه
Improving XCP to Achieve Max-Min Fair Bandwidth Allocation
TCP is shown to be inefficient and instable in high speed and long latency networks. The eXplicit Control Protocol (XCP) is a new and promising protocol that outperforms TCP in terms of efficiency, stability, queue size, and convergence speed. However, Low et al. recently discovered a weakness of XCP. In a multi-bottleneck environment, XCP may achieve as low as 80% utilization at a bottleneck l...
متن کاملFair Admission Control to Achieve Guaranteed Bandwidth Allocation
In this paper, we present a theoretic framework for admission controls and bandwidth allocations at network links to achieve guaranteed bandwidth allocations, which guarantee to allocate admitted flows data rates that are above their required minimum bandwidths. The admission control and bandwidth allocation are devised from the optimal solution of maximizing aggregate social welfare of the net...
متن کاملA Relative Bandwidth Allocation Method Enabling Fast Convergence in XCP
The eXplicit Control Protocol (XCP), which explicitly sends feedback information on the current network resource condition to endhosts to control congestion, is a promising protocol for the network supported congestion control that will be needed in the future Internet. Because of its flexibility, XCP can provide relative bandwidth allocation service that is impossible with other protocols. How...
متن کاملA distributed scheduling method for maxmin fair bandwidth allocation in wireless ad hoc networks
We propose an algorithm for design and on the fly modification of the schedule of a wireless ad hoc network for provision of fair service guarantees under topological changes. The primary objective is to derive a distributed coordination method for schedule construction and modification for any wireless ad-hoc network that operates under a schedule where transmissions at each slot are explicitl...
متن کاملA Decentralized Framework to Achieve Max-min Fair Bandwidth Allocation for Atm Networks
We consider a flow control algorithm to allocate bandwidth in a network subject to throughput and fairness constraints. Our algorithm achieves a max-min fair allocation among contending users, and has desirable properties in that it can operate in a decentralized and asynchronous manner accounting in part for heterogeneity in round trip delays. The algorithm is simple in that, 1), the network l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Networks
سال: 2010
ISSN: 1389-1286
DOI: 10.1016/j.comnet.2008.08.025